Welcome![Sign In][Sign Up]
Location:
Search - 01 knapsack

Search list

[OS program017387-01

Description: 论坛代码 用分支界限法解决的几个问题:包括0-1背包问题,最大团问题,电路布线问题,最大装载问题.作业最优处理问韪-Forum with the branch code boundaries to solve several problems : including 0-1 knapsack problem, the largest group, circuit wiring problem, the greatest problem loading. Optimal operating handle condemnation
Platform: | Size: 2736644 | Author: yuanjianping | Hits:

[Mathimatics-Numerical algorithms01beibao

Description: 算法与数据结构——快速排序 01背包问题,是一个简单的程序,高手就不用研究了-Algorithms and data structures- quick sort 01 knapsack problem is a simple procedure, you need to conduct a study on the
Platform: | Size: 22528 | Author: jian | Hits:

[Mathimatics-Numerical algorithms01

Description: 01背包问题的经典实现。在VC6下面调试通过。学习算法的朋友可以借鉴一下-01 to achieve the classic knapsack problem. VC6 debugger in the following through. Learning algorithm can learn from you friends
Platform: | Size: 68608 | Author: atl | Hits:

[Data structspack1

Description: 01背包问题 用算法分之方法解决的问题-01 knapsack problem with algorithms to solve the problem of points
Platform: | Size: 1024 | Author: wxh | Hits:

[Mathimatics-Numerical algorithmsOIknap

Description: 用VC编写的01背包问题,功能强大,是在老师的指导下完成的,大家可以用来参考-VC prepared with 01 knapsack problem, powerful, is completed under the guidance of teachers, and everyone can be used to reference
Platform: | Size: 431104 | Author: 清水 | Hits:

[Data structsbeibaowenti

Description: 动态规划求01背包问题. 动态规划求01背包问题.-Dynamic programming for knapsack problem 01. Dynamic programming for knapsack problem 01.
Platform: | Size: 1024 | Author: aa | Hits:

[MPI01knapsack

Description: MPI 并行编程 一维0/1口袋问题 动态规划 求优化解-MPI parallel programming one-dimensional 0/1 pocket of the problem of dynamic programming for optimal solution
Platform: | Size: 2048 | Author: sangecoa | Hits:

[Mathimatics-Numerical algorithms01bag

Description: 01背包问题c语言实现 01背包问题c语言实现-01 knapsack problem c language c language of 01 knapsack problem implementation
Platform: | Size: 1024 | Author: dawn | Hits:

[AI-NN-PRcode

Description: 回溯法求01背包问题,c语言版本,由于时间关系没有将代码进行很好的整理,所有代码都在一个文件中-Retrospective Method 01 knapsack problem, c language versions, due to time not finishing a very good code, all code in one file
Platform: | Size: 1024 | Author: guifeng2002 | Hits:

[Data structs0-1Knapsack.problem

Description: Knapsack problemnew01背包问题(动态规划) 01背包实验报告-Knapsack problemnew01 knapsack problem (dynamic programming) 01 backpack Experimental Report
Platform: | Size: 3212288 | Author: ggq | Hits:

[Windows Develop01pack

Description: 01背包问题,计算机算法中使用贪心算法与贪心策略的实现-01 knapsack problem, the computer algorithm with the greedy algorithm using the greedy strategy to achieve
Platform: | Size: 263168 | Author: zym | Hits:

[Data structs01knapsackMFC

Description: 01背包问题演示程序 用mfc实现01背包问题的dp算法-01 knapsack problem with mfc demo program to achieve 01 knapsack problem algorithm dp
Platform: | Size: 47104 | Author: 纪旭 | Hits:

[Data structs01pack

Description: 01背包问题,用动态规划实现的,里面讲得很详细-01 knapsack problem, using dynamic programming to achieve, which made detailed
Platform: | Size: 1024 | Author: scf | Hits:

[matlabsa_01

Description: 本程序是在MATLAB平台上面实现的用模拟退火算法解决01背包问题。-This procedure is in the MATLAB platform achieved with simulated annealing algorithm to solve knapsack problem 01.
Platform: | Size: 1024 | Author: 周薇 | Hits:

[Mathimatics-Numerical algorithms01beibaoshutafugai

Description: 这是学习动态规划时用动态规划设计分析实际问题,用动态规划方法设计的数塔问题,棋盘覆盖,和01背包问题的源码,希望朋友们需要的话可以下载-This is used to study dynamic programming dynamic programming design and analysis of practical problems, using dynamic programming method of a number of tower design problem, board cover, and the source 01 knapsack problem, I hope my friends can download if necessary to see
Platform: | Size: 2048 | Author: 张陆军 | Hits:

[CSharp01packbag

Description: 01 背包问题的 c语言源代码实现 很简单-01 knapsack problem c language source code of the implementation
Platform: | Size: 1024 | Author: linjia | Hits:

[Mathimatics-Numerical algorithms01bag

Description: 用回溯方法写的01背包问题,有中文注释,很容易懂!-Methods used to write back the 01 knapsack problem, a Chinese note, it is easy to understand!
Platform: | Size: 899072 | Author: 吴男 | Hits:

[Data structs01bag

Description: 01背包问题最简单实现,可在其上做更多的扩展,不知道可否不用递归用堆栈-01 knapsack problem to achieve the most simple, can do more in its expansion, I do not know can not use recursive stack
Platform: | Size: 7168 | Author: 刘建林 | Hits:

[Data structs01package

Description: 01背包算法 解决算法 与众大侠一起参考 交流 -01 knapsack algorithm to solve algorithm and the public with reference to the exchange of heroes
Platform: | Size: 1024 | Author: 徐坚 | Hits:

[Data structsbeibao

Description: 此代码实现的是01背包问题 具体实现方法是用c完成滴-This code is a 01 knapsack problem of the specific method is used to achieve complete drop c
Platform: | Size: 1024 | Author: 张三 | Hits:
« 1 2 34 5 6 7 8 »

CodeBus www.codebus.net